Scalable Distributed Data Structure By Record Grouping

LH*g is a high-availability variant of the LH* Scalable Distributed Data Structure. An LH*g file scales up with constant key search and insert performance, while surviving any single-site unavailability (failure). Highavailability is achieved through record grouping. A group is a logical structure of up to k records, where k is a file parameter. The group members always remain at different sites, regardless of moves due to splits while the file scales up. Every group contains a parity record allowing the reconstruction of an unavailable member. The basic schema may be generalized to support unavailability of any number of sites, at the expense of storage and messaging. Other known high-availability schemes are static, or require more storage, or provide worse search performance.